Theory of division games

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A review on symmetric games: theory, comparison and applications

Game theory models decision makers' behaviors in strategic situations. Since the structures of games are different, behavior and preferences of the players are different in various types of game. This paper reviews various situations of games. Here, characteristics of some common games are discussed and compared. Specifically, we focus on a group of games called symmetric games including Prison...

متن کامل

Bankruptcy Assessment with the Interval Programming and Games Theory

Some of the parameters in issues of the reality world are uncertainty. One of the uncertain problems with the qualitative parameters is economic problems such as bankruptcy problem. In this case, there is a probability of dealing with imprecise concepts including the intervals regarding the official’s viewpoint, organizations’ managers. Accordingly, this article uses the concepts of data envelo...

متن کامل

Theory of Combinatorial Games

Aim: To present a systematic development of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to Chess in small strides at a gradient that’s not too steep. Presentation: Largely informal; examples of com...

متن کامل

Theory of Conditional Games

Game theory explains how to make good choices when different decision makers have conflicting interests. The classical approach assumes that decision makers are committed to making the best choices for themselves regardless of the effect on others, but such an approach is less appropriate when cooperation, compromise, and negotiation are important. This book describes conditional games, an exte...

متن کامل

Theory of Quantum Games

We pursue a general theory of quantum games. In particular, we develop quantum generalizations of the two most important theorems from classical game theory: the Minimax Theorem and the Nash Equilibrium Theorem. We then show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. [email protected] [email protected]

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences

سال: 1978

ISSN: 0034-5318

DOI: 10.2977/prims/1195189068